Optimal Control of Flexible Servers in Two Tandem Queues with Operating Costs
نویسنده
چکیده
We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. We assume exponential service times, linear holding costs, and operating costs incurred by the servers at rates proportional to their speeds. Under conditions that ensure the optimality of nonidling policies, we show that the optimal allocation of flexible servers is determined by a transition-monotone policy. Moreover, we present conditions under which the optimal policy can be explicitly determined.
منابع مشابه
A Complete Solution for the Optimal Stochastic Scheduling of a Two-stage Tandem Queue with Two Flexible Servers
We consider a two-stage tandem queue with two parallel servers and two queues. We assume that initially all jobs are present and that no further arrivals take place at any time. The two servers are identical and can serve both types of job. The processing times are exponentially distributed. After being served, a job of queue 1 joins queue 2, whereas a job of queue 2 leaves the system. Holding ...
متن کاملOptimal Control of a Two-stage Tandem Queuing System with Flexible Servers
We consider the optimal control of two parallel servers in a two-stage tandem queuing system with two flexible servers+ New jobs arrive at station 1, after which a series of two operations must be performed before they leave the system+ Holding costs are incurred at rate h1 per unit time for each job at station 1 and at rate h2 per unit time for each job at station 2+ The system is considered u...
متن کاملFlexible Servers in Tandem Lines with Setups
We study the dynamic assignment of flexible servers to stations in the presence of setup costs that are incurred when servers move between stations. We focus on tandem lines with two stations and two servers with the goal of maximizing the long-run average profit. We investigate how the optimal server assignment policy for such systems depends on the magnitude of the setup costs, as well as on ...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملServer Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
For a system of nite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel times between di erent service facilities are negligible, that each server can only work on one job at a time, and that several servers can work together on one job. We show that when the service rates depend...
متن کامل